Polynomial Time Approximation Schemes for the Euclidean Traveling Salesman Problem
نویسندگان
چکیده
In this report, we aim to understand the key ideas and major techniques used in the assigned paper "Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems" by Sanjeev Arora. We also provide a review of related literature with an emphasis on the concurrent work by Joseph S. B. Mitchell. One presentation topic is selected from Arora’s paper and the other topic is from Mitchell’s paper.
منابع مشابه
Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems
We present a polynomial time approximation scheme for Euclidean TSP in <2. Given any n nodes in the plane and > 0, the scheme finds a (1 + )-approximation to the optimum traveling salesman tour in time nO(1= ). When the nodes are in <d, the running time increases to nÕ(logd 2 n)= d 1 . The previous best approximation algorithm for the problem (due to Christofides) achieves a 3=2approximation in...
متن کاملPolynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces
13.1 Introduction Many geometric optimization problems which are interesting and important in practice have been shown to be NP-hard. However, for some cases it is possible to compute approximate solutions in polynomial time. This chapter describes approaches to nd polynomial time algorithms that compute approximate solutions to various geometric optimization problems in Eu-clidean metric space...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملThe Traveling Salesman Problem under Squared Euclidean Distances
Let P be a set of points in R, and let α > 1 be a real number. We define the distance between two points p, q ∈ P as |pq|, where |pq| denotes the standard Euclidean distance between p and q. We denote the traveling salesman problem under this distance function by Tsp(d,α). We design a 5-approximation algorithm for Tsp(2,2) and generalize this result to obtain an approximation factor of 3 + √ 6 ...
متن کاملNearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems
We present a randomized polynomial time approximation scheme for Euclidean TSP in < 2 that is substantially more eecient than our earlier scheme in 2] (and the scheme of Mitchell 21]). For any xed c > 1 and any set of n nodes in the plane, the new scheme nds a (1+ 1 c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c)) time. (Our earlier scheme ran in n O(c) time.) For poi...
متن کامل